On Logically Defined Recognizable Tree Languages
نویسندگان
چکیده
We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindström quantifiers, and particular cases include first-order logic and modular logic. The algebraic characterization we give is expressed in terms of a new algebraic structure, finitary preclones, and uses a generalization of the block product operation.
منابع مشابه
Algebraic recognizability of regular tree languages
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Σ-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss importa...
متن کاملOn the Complexity of the Syntax of Tree Languages
The syntactic complexity of a tree language is defined according to the number of the distinct syntactic classes of all trees with a fixed yield length. This leads to a syntactic classification of tree languages and it turns out that the class of recognizable tree languages is properly contained in that of languages with bounded complexity. A refined syntactic complexity notion is also presente...
متن کاملClasses of Tree Languages and DR Tree Languages Given by Classes of Semigroups
In the first section of the paper we give general conditions under which a class of recognizable tree languages with a given property can be defined by a class of monoids or semigroups defining the class of string languages having the same property. In the second part similar questions are studied for classes of (DR) tree languages recognized by deterministic root-to-frontier tree recognizers.
متن کاملRecognizability of Pomset Languages with Event Reenement
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognizable pomset languages have extended closur...
متن کاملOn labeled birooted tree languages: Algebras, automata and logic
With an aim to developing expressive language theoretical tools applicable to inverse semigroup languages, that is, subsets of inverse semigroups, this paper explores the language theory of finite labeled birooted trees: Munn’s birooted trees extended with vertex labeling. To this purpose, we define a notion of finite state birooted tree automata that simply extends finite state word automata s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003